Burning Numbers of t-unicyclic Graphs

Given a graph G, the burning number of G is smallest integer k for which there are vertices $$x_1, x_2,\ldots ,x_k$$ such that $$(x_1,x_2,\ldots ,x_k)$$ sequence G. It has been shown problem NP-complete, even trees with maximum degree three, or linear forests. A t-unicyclic unicycle in unique vertex greater than two $$ t + 2 . In this paper, we first present bounds graphs, and then use numbers forests at most three components to determine all graphs $$t\le 2$$